Quantized Corrupted Sensing with Random Dithering
نویسندگان
چکیده
Corrupted sensing concerns the problem of recovering a high-dimensional structured signal from collection measurements that are contaminated by unknown corruption and unstructured noise. In case linear measurements, recovery performance different convex programming procedures (e.g., generalized Lasso its variants) is well established in literature. However, practical applications digital processing, quantization process inevitable, which often leads to non-linear measurements. This paper devoted studying corrupted under quantized Specifically, we demonstrate that, with aid uniform dithering, both constrained unconstrained Lassos able recover samples when measurement matrix sub-Gaussian. Our theoretical results reveal role resolution Lassos. Numerical experiments provided confirm our results.
منابع مشابه
Quantized Compressive Sensing with RIP Matrices: The Benefit of Dithering
In Compressive Sensing theory and its applications, quantization of signal measurements, as integrated into any realistic sensing model, impacts the quality of signal reconstruction. In fact, there even exist incompatible combinations of quantization functions (e.g., the 1-bit sign function) and sensing matrices (e.g., Bernoulli) that cannot lead to an arbitrarily low reconstruction error when ...
متن کاملCompressed sensing with corrupted observations
We proposed a weighted l minimization: min , ‖x‖ + λ‖f‖ s.t.Ax+ f= b to recover a sparse vector x and the corrupted noise vector f from a linear measurement b = Ax + f when the sensing matrix A is an m × n row i.i.d subgaussian matrix. Our first result shows that the recovery is possible when the fraction of corrupted noise is smaller than a positive constant, provided that ‖x‖ ≤ O(n/ln (n/‖x ∗...
متن کاملTime for dithering: fast and quantized random embeddings via the restricted isometry property
Recently,manyworks have focused on the characterization of nonlinear dimensionality reductionmethods obtained by quantizing linear embeddings, e.g. to reach fast processing time, efficient data compression procedures, novel geometry-preserving embeddings or to estimate the information/bits stored in this reduced data representation. In this work, we prove that many linear maps known to respect ...
متن کاملForced Random Dithering: Improved Threshold Matrices for Ordered Dithering
This paper examines the possibilities of improving halftoning techniques using dispersed dots. This corresponds to finding micro-dot distributions that approximate the intensity levels that have to be rendered. A widely used halftoning method is ordered dithering, which uses a threshold matrix to decide if a micro-dot should be set in the output image. A way to generate improved threshold matri...
متن کاملCompressed sensing with corrupted Fourier measurements
This paper studies a data recovery problem in compressed sensing (CS), given a measurement vector b with corruptions: 0 0 b Ax f , can we recover 0 x and 0 f via the reweighted 1 minimization: , 1 1 min || || || , . || . x f x f s t Ax f b ? Where the m n measurement matrix A is a partial Fourier matrix, 0 x denotes the n dimensional ground true signal vector...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2022
ISSN: ['1053-587X', '1941-0476']
DOI: https://doi.org/10.1109/tsp.2022.3141884